Screening synteny blocks in pairwise genome comparisons through integer programming
نویسندگان
چکیده
منابع مشابه
Simultaneous Solution to Synteny Blocks Construction and Genome Rearrangements Problems
Synteny block construction. Synteny blocks, which are fundamental components in revealing evolutionary history, are formed by conserved sequences of homologous genes in different genomes. To enable rearrangement analysis of given genomes, they are first represented as sequences of non-overlapping synteny blocks (synteny block construction problem). Recent approaches for synteny blocks construct...
متن کاملEstimating Unobserved Individual Heterogeneity through Pairwise Comparisons
This paper proposes a new methodology to study environments with unobserved agent heterogeneity. We focus on the settings where the heterogeneous factor takes values from an unknown finite set, and the economic model yields testable implications in the form of pairwise inequalities. The method produces a consistent classification of economic agents according to their unobserved types. The paper...
متن کاملInference in Credal Networks Through Integer Programming
A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal n...
متن کاملPairwise Comparisons Simplified
This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from n · (n − 1) to n − 1. An algorithm of reconstructing of the PC matrix from its set of generators is presented.
متن کاملGenome-wide synteny through highly sensitive sequence alignment: Satsuma
MOTIVATION Comparative genomics heavily relies on alignments of large and often complex DNA sequences. From an engineering perspective, the problem here is to provide maximum sensitivity (to find all there is to find), specificity (to only find real homology) and speed (to accommodate the billions of base pairs of vertebrate genomes). RESULTS Satsuma addresses all three issues through novel s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2011
ISSN: 1471-2105
DOI: 10.1186/1471-2105-12-102